-
1 строго возрастающая последовательность
Русско-английский научно-технический словарь Масловского > строго возрастающая последовательность
-
2 строго возрастающая последовательность
Mathematics: strictly increasing sequenceУниверсальный русско-английский словарь > строго возрастающая последовательность
См. также в других словарях:
Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length … Wikipedia
Ergodic sequence — In mathematics, an ergodic sequence is a certain type of integer sequence, having certain equidistribution properties.DefinitionLet A = {a j} be an infinite, strictly increasing sequence of positive integers. Then, given an integer q , this… … Wikipedia
Disjunctive sequence — A disjunctive sequence is an infinite sequence (over a finite alphabet of characters) in which every finite string appears as a substring. For instance, the binary Champernowne sequence formed by concatenating all binary strings in shortlex order … Wikipedia
Normal sequence — In mathematics, the term normal sequence has multiple meanings, depending on the area of specialty. In general, it is a sequence with nice properties. In set theory, a normal sequence is one that is continuous and strictly increasing. In… … Wikipedia
Farey sequence — In mathematics, the Farey sequence of order n is the sequence of completely reduced fractions between 0 and 1 which, when in lowest terms, have denominators less than or equal to n , arranged in order of increasing size.Each Farey sequence starts … Wikipedia
Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… … Wikipedia
Base (topology) — In mathematics, a base (or basis) B for a topological space X with topology T is a collection of open sets in T such that every open set in T can be written as a union of elements of B. We say that the base generates the topology T. Bases are… … Wikipedia
McNaughton's Theorem — In automata theory, McNaughton s theorem refers to a theorem that asserts that the set of ω regular languages is identical to the set of languages recognizable by deterministic Muller automata. [1] This theorem is proven by supplying an algorithm … Wikipedia
Subsequence — In mathematics, a subsequence of some sequence is a new sequence which is formed from the original sequence by deleting some of the elements without disturbing the relative positions of the remaining elements. Formally, suppose that X is a set… … Wikipedia
Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic … Wikipedia
Spectral theory of compact operators — In functional analysis, compact operators are linear operators that map bounded sets to precompact ones. Compact operators acting on a Hilbert space H is the closure of finite rank operators in the uniform operator topology. In general, operators … Wikipedia